Study on convergence and error of a numerical method for solving systems of nonlinear Fredholm–Volterra integral equations of Hammerstein type

The aim of this paper is to present an efficient analytical and numerical procedure for solving systems of nonlinear Fredholm–Volterra integral equations of the Hammerstein type with the aid of fixed point techniques and the usual Schauder basis in an adequate Banach space.     

Further study of alternating iterations for rectangular matrices

Theory of matrix splittings is a useful tool in the analysis of iterative methods for solving systems of linear equations. When two splittings are given, it is of interest to compare the spectral radii of the corresponding iteration matrices. This helps to arrive at the conclusion that which splitting should one choose so that one can reach the desired solution of accuracy or the exact solution in a faster way. In the case of many splittings are provided, the comparison of the spectral radii is time-consuming. Such a situation can be overcome by introducing another iteration scheme which converges to the same solution of interest in a much faster way. In this direction, the theory of alternating iterations for real rectangular matrices is recently proposed. In this note, some more results to the theory of alternating iterations are added. A comparison result of two different alternating iteration schemes is then presented which will help us to choose the iteration scheme that will guarantee the faster convergence of the alternating iteration scheme. In addition to these results, a comparison result for proper weak regular splittings is also obtained.     

Superconvergence of the direct discontinuous Galerkin method for convection‐diffusion equations

This paper is concerned with superconvergence properties of the direct discontinuous Galerkin (DDG) method for one‐dimensional linear convection‐diffusion equations. We prove, under some suitable choice of numerical fluxes and initial discretization, a 2k‐th and ‐th order superconvergence rate of the DDG approximation at nodes and Lobatto points, respectively, and a ‐th order of the derivative approximation at Gauss points, where k is the polynomial degree. Moreover, we also prove that the DDG solution is superconvergent with an order k + 2 to a particular projection of the exact solution. Numerical experiments are presented to validate the theoretical results. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 290–317, 2017     

A fast discontinuous finite element discretization for the space‐time fractional diffusion‐wave equation

In this article, we study fast discontinuous Galerkin finite element methods to solve a space‐time fractional diffusion‐wave equation. We introduce a piecewise‐constant discontinuous finite element method for solving this problem and derive optimal error estimates. Importantly, a fast solution technique to accelerate Toeplitz matrix‐vector multiplications which arise from discontinuous Galerkin finite element discretization is developed. This fast solution technique is based on fast Fourier transform and it depends on the special structure of coefficient matrices. In each temporal step, it helps to reduce the computational work from required by the traditional methods to log , where is the size of the coefficient matrices (number of spatial grid points). Moreover, the applicability and accuracy of the method are verified by numerical experiments including both continuous and discontinuous examples to support our theoretical analysis.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 2043–2061, 2017     

Statistical and Geometrical Way of Model Selection for a Family of Subdivision Schemes

The objective of this article is to introduce a generalized algorithm to produce the m-point n-ary approximating subdivision schemes(for any integer m, n ≥ 2). The proposed algorithm has been derived from uniform B-spline blending functions. In particular, we study statistical and geometrical/traditional methods for the model selection and assessment for selecting a subdivision curve from the proposed family of schemes to model noisy and noisy free data. Moreover, we also discuss the deviation of subdivision curves generated by proposed family of schemes from convex polygonal curve. Furthermore, visual performances of the schemes have been presented to compare numerically the Gibbs oscillations with the existing family of schemes.     

A half-space projection method for solving generalized Nash equilibrium problems

The generalized Nash equilibrium problem (GNEP) is an n-person noncooperative game in which each player’s strategy set depends on the rivals’ strategy set. In this paper, we presented a half-space projection method for solving the quasi-variational inequality problem which is a formulation of the GNEP. The difference from the known projection methods is due to the next iterate point in this method is obtained by directly projecting a point onto a half-space. Thus, our next iterate point can be represented explicitly. The global convergence is proved under the minimal assumptions. Compared with the known methods, this method can reduce one projection of a vector onto the strategy set per iteration. Numerical results show that this method not only outperforms the known method but is also less dependent on the initial value than the known method.     

双调和算子特征值问题的混合三角谱元方法

本文针对双调和算子特征值问题设计了基于混合变分形式的三角谱元逼近格式,其基函数采用指标为(-1,-1,-1)的广义Koornwinder多项式.在H~1-及H_0~1-正交谱元投影的逼近理论基础上,我们建立了双调和算子特征值与特征函数的收敛性估计;它关于网格尺寸h是最优的,关于多项式次数M是次优的.然而,在H_0~2-正交谱元投影的最优估计假设前提下,关于M的次优收敛阶估计则提升为最优.此外,Koornwinder分片多项式逼近的结果还表明,在带权Besov空间范数的度量下,对于存在着区域角点奇性的双调和算子特征值问题,谱元方法的收敛阶能达到h-型有限元方法的2倍.最后,本文的数值实验结果展示了谱元逼近格式的高效性,同时也验证了相关理论的正确性.     

带1-范数约束的分裂可行问题的投影算法

本文主要研究带1-范数约束的分裂可行问题的求解算法.用一种交替投影算法,求得了问题的解,提出松弛交替投影算法,改进了直接往闭凸集上投影这一不足,并证明了该算法的收敛性.     

基于果蝇算法优化广义回归神经网络的矢量水听器的DOA估计

为了提高矢量水听器阵列对窄带信号的DOA估计精度,运用果蝇算法优化广义回归神经网络,通过对阵列协方差矩阵实值化,并提取信号子空间的基作为样本特征进行网络训练,构建了果蝇算法优化下的广义回归神经网络,实现了基于矢量水听器阵列的水下声源的DOA估计.仿真实验结果表明,方法泛化性能较好,能解决输入维数过大的问题,且运行时间短,DOA估计精度高,具有较强的工程应用价值.     

可行策略对应的图像拓扑下广义博弈Nash平衡的稳定性

以往关于广义博弈Nash平衡的稳定性的研究,均利用可行策略映射之间的一致度量.现考虑在更弱的度量下,利用可行策略映射图像之间的Hausdorff距离定义度量.在此弱图像拓扑下,证明了广义博弈空间的完备性,以及Nash平衡映射的上半连续性和紧性,进而得到广义博弈Nash平衡的通有稳定性.即在Baire分类的意义下,大多数的广义博弈都是本质的.